New Methods for Generating Short Addition Chains

The number of maximal matchings in polyphenylene chains

A matching is maximal if no other matching contains it as a proper subset. Maximal matchings model phenomena across many disciplines, including applications within chemistry. In this paper, we study maximal matchings in an important class of chemical compounds: polyphenylenes. In particular, we determine the extremal polyphenylene chains in regards to the number of maximal matchings. We also de...

Latus: A new accelerator for generating combined iterative methods in solving nonlinear equation

Identification of Disruptions and Associated Resilience Strategies in Blood Supply Chain Using a New Combined Approach

INTRODUCTION: Supply chains face various disruptions from human-made to natural disasters preventing proper flow of materials and products. This problem is more important in the healthcare supply chains, especially the blood supply chains, in which human lives are at risk. Making the supply chains resilient, recently addressed by managers and researchers, can be a good way to tackle them. This ...

Efficient computation of addition-subtraction chains using generalized continued Fractions

The aim of this paper is to present a new way of computing short addition-subtraction chains using the generalized continued fractions where subtraction is allowed. We will recover the most used ways of getting addition-subtraction chains. This method is not always optimal but gives minimal chains that are easy to compute.

Hosoya polynomials of random benzenoid chains

Let $G$ be a molecular graph with vertex set $V(G)$, $d_G(u, v)$ the topological distance between vertices $u$ and $v$ in $G$. The Hosoya polynomial $H(G, x)$ of $G$ is a polynomial $sumlimits_{{u, v}subseteq V(G)}x^{d_G(u, v)}$ in variable $x$. In this paper, we obtain an explicit analytical expression for the expected value of the Hosoya polynomial of a random benzenoid chain with $n$ hexagon...